|
Functional decomposition refers broadly to the process of resolving a functional relationship into its constituent parts in such a way that the original function can be reconstructed (i.e., recomposed) from those parts by function composition. In general, this process of decomposition is undertaken either for the purpose of gaining insight into the identity of the constituent components (which may reflect individual physical processes of interest, for example), or for the purpose of obtaining a compressed representation of the global function, a task which is feasible only when the constituent processes possess a certain level of ''modularity'' (i.e., independence or non-interaction). Interactions between the components are critical to the function of the collection. All interactions may not be observable, but possibly deduced through repetitive perception, synthesis, validation and verification of composite behavior. == Basic mathematical definition == For a multivariate function , functional decomposition generally refers to a process of identifying a set of functions such that : where is some other function. Thus, we would say that the function is decomposed into functions . This process is intrinsically hierarchical in the sense that we can (and often do) seek to further decompose the functions into a collection of constituent functions such that : where is some other function. Decompositions of this kind are interesting and important for a wide variety of reasons. In general, functional decompositions are worthwhile when there is a certain "sparseness" in the dependency structure; that is, when constituent functions are found to depend on approximately disjoint sets of variables. Thus, for example, if we can obtain a decomposition of into a hierarchical composition of functions such that , , , as shown in the figure at right, this would probably be considered a highly valuable decomposition. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「functional decomposition」の詳細全文を読む スポンサード リンク
|